Iof proof for Lemma connex functionality wrt implies:
1. T : Type
2. R : T
T
3. R' : T
T
4.
x, y:T. {R(x,y) 
R'(x,y)}
5.
x, y:T. R'(x,y) 
R'(y,x)
6. x : T
7. y : T
R'(x,y) R'(y,x)
by ((BHyp 5)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 4:n
C)) (first_tok :t) inil_term)))
C.
T